Turing’s unpublished algorithm for normal numbers
نویسندگان
چکیده
منابع مشابه
Turing's unpublished algorithm for normal numbers
In an unpublished manuscript Alan Turing gave a computable construction to show that absolutely normal real numbers between 0 and 1 have Lebesgue measure 1; furthermore, he gave an algorithm for computing instances in this set. We complete his manuscript by giving full proofs and correcting minor errors. While doing this, we recreate Turing’s ideas as accurately as possible. One of his original...
متن کاملAlgorithm for normal random numbers.
We propose a simple algorithm for generating normally distributed pseudorandom numbers. The algorithm simulates N molecules that exchange energy among themselves following a simple stochastic rule. We prove that the system is ergodic, and that a Maxwell-like distribution that may be used as a source of normally distributed random deviates follows in the N-->infinity limit. The algorithm passes ...
متن کاملA polynomial-time algorithm for computing absolutely normal numbers
We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
متن کاملNormal Numbers Are Normal
A number is normal in base b if every sequence of k symbols in the letters 0, 1, . . . , b− 1 occurs in the base-b expansion of the given number with the expected frequency b−k. From an informal point of view, we can think of numbers normal in base 2 as those produced by flipping a fair coin, recording 1 for heads and 0 for tails. Normal numbers are those which are normal in every base. In this...
متن کاملA Queue-Based Genetic Algorithm (QGA) -- Unpublished Manuscript
This paper proposes a novel GA called “a queue-based genetic algorithm.” This algorithm is unique in that the data structure of the population is based on a first-in-first-out queue, and it is the key idea to realize asynchronous structure of the algorithm. This algorithm is in particular developed in relation to interactive evolutionary computation (IEC) framework, and the characteristics of Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.022